منابع مشابه
Integration formulas for the conditional transform involving the first variation
In this paper, we show that the conditional transform with respect to the Gaussian process involving the first variation can be expressed in terms of the conditional transform without the first variation. We then use this result to obtain various integration formulas involving the conditional $diamond$-product and the first variation.
متن کاملApproximating Closed Rational Surfaces
In this chapter, the problem of drawing a closed rational surface is considered. As in the case of rational curves, the key to drawing a closed rational surface is to partition the parameter domain into simple connected regions Ri such as triangles or rectangles, in such a way that there is some prespecified region R0 and some projectivities such that every other region is the image of the regi...
متن کاملOn computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملExtracting Minimal and Closed Monotone DNF Formulas
In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover designed by Hirata et al. (2003) with the algorithm Charm designed by Zaki and Hsiao (2002), we design the algorithm cdnf cover to extract closed monotone DNF formulas with a pruning as same as dnf cover . Finally, we implement c...
متن کاملConstruction of fully symmetric numerical integration formulas of fully symmetric numerical integration formulas
The paper develops a construction for finding fully symmetric integration formulas of arbitrary degree 2k + t in n-space such that the number of evaluation points is O ((2n)k/k t), n ~ . Formulas of degrees 3, 5, 7, 9, are relatively simple and are presented in detail. The method has been tested by obtaining some special formulas of degrees 7, 9 and 1 t but these are not presented here.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1966
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/8.4.362